| 翻訳と辞書 |
| Still life (cellular automaton) ： ウィキペディア英語版 |
Still life (cellular automaton)
In Conway's Game of Life and other cellular automata, a still life is a pattern that does not change from one generation to the next. A still life can be thought of as an oscillator with unit period.〔(【引用サイトリンク】accessdate=2009-01-24 )〕
==Pseudo still lifes==
A pseudo still life consists of two or more adjacent islands which can be partitioned (either individually or as sets) into non-interacting subparts, which are also still lifes. This compares with a strict still life, in which the islands depend on one another for stability, and thus cannot be decomposed. The distinction between the two is not always obvious, as a strict still life may have multiple connected components all of which are needed for its stability. However, it is possible to determine whether a still life pattern is a strict still life or a pseudo still life in polynomial time by searching for cycles in an associated skew-symmetric graph.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Still life (cellular automaton)」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|